Minimal Critical Subsystems for Discrete-Time Markov Models

نویسندگان

  • Ralf Wimmer
  • Nils Jansen
  • Erika Ábrahám
  • Bernd Becker
  • Joost-Pieter Katoen
چکیده

We propose a new approach to compute counterexamples for violated ω-regular properties of discrete-time Markov chains and Markov decision processes. Whereas most approaches compute a set of system paths as a counterexample, we determine a critical subsystem that already violates the given property. In earlier work we introduced methods to compute such subsystems based on a search for shortest paths. In this paper we use SMT solvers and mixed integer linear programming to determine minimal critical subsystems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Lifetime Behavior of a New Discrete Time Mixed $delta$-shock Model

In this study, a mixed $delta$-shock model with discrete-time is defined by combining $delta$-shock and extreme shock models. In this model, a system with multiple states fails in two ways: first, when k interarrival times between two consecutive shocks with magnitude larger than the critical threshold $gamma$ are in $[delta_1, delta _2], delta_1 < delta _2$; and second, when the interarrival t...

متن کامل

Counterexample Generation for Discrete-Time Markov Models: An Introductory Survey

This paper is an introductory survey of available methods for the computation and representation of probabilistic counterexamples for discrete-time Markov chains and probabilistic automata. In contrast to traditional model checking, probabilistic counterexamples are sets of finite paths with a critical probability mass. Such counterexamples are not obtained as a by-product of model checking, bu...

متن کامل

Arrival probability in the stochastic networks with an established discrete time Markov chain

The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...

متن کامل

Minimal counterexamples for linear-time probabilistic verification

Counterexamples for property violations have a number of important applications like supporting thedebugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement.In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markovdecision processes as counterexamples for violated ω-regular propertie...

متن کامل

Reliability Model of Power Transformer with ONAN Cooling

Reliability of a power system is considerably influenced by its equipments. Power transformers are one of the most critical and expensive equipments of a power system and their proper functions are vital for the substations and utilities. Therefore, reliability model of power transformer is very important in the risk assessment of the engineering systems. This model shows the characteristic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012